Very Fast Tree-structured Vector Quantization
نویسنده
چکیده
Very fast tree-structured vector quantization employs scalar quantization decisions at each level, but chooses the dimension on which to quantize based on the coordinate direction of maximum variance. Because the quantization is scalar, searches are no more complex than scalar quantization − providing significant improvement in complexity over full-searched or even tree-structured vector quantization − but the method preserves the shape and memory advantages of conventional vector quantization. However, the space filling advantage of VQ is forfeited, since each Voronoi cell is a rectangular cuboid.
منابع مشابه
Conditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory
An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...
متن کاملImage Vector Quantization with Hierarchical Tree Structure
The tree-structured vector quantization (TSVQ) is an efficient method for the vector quantization (VQ). In this paper, we propose a new tree structure model, hierarchical tree structure (HTS), to reduce encoding time. Briefly, the HTSVQ decreases the dimension of the vector on the upper levels of the codebook tree. If the vector dimension decreases, then the searching time on the codebook tree ...
متن کاملVariable-length constrained-storage tree-structured vector quantization
Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho (1990, 1991) allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established by Makhoul et al. (1985), Riskin et al. (1991), and by Mahesh et al. (see IEEE Trans. Inform. Theory, vol.41, p.917-30,...
متن کاملFine granularity scalable speech coding using embedded tree-structured vector quantization
This paper proposes an efficient codebook design for tree-structured vector quantization (TSVQ) that is embedded in nature. We modify two speech coding standards by replacing their original quantizers for line spectral frequencies (LSF’s) and/or Fourier magnitudes quantization with TSVQ-based quantizers. The modified coders are fine-granular bit-rate scalable with gradual change in quality for ...
متن کاملFast Image Database Search using Tree-Structured VQ∗
In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, there...
متن کامل